polynomial transform

См. также в других словарях:

• Polynomial interpolation — In the mathematical subfield of numerical analysis, polynomial interpolation is the interpolation of a given data set by a polynomial. In other words, given some data points (such as obtained by sampling), the aim is to find a polynomial which… …   Wikipedia

• Polynomial Diophantine equation — In mathematics, a polynomial Diophantine equation is an indeterminate polynomial equation whose solutions are restricted to be polynomials in the indeterminate. A Diophantine equation, in general, is one where the solutions are restricted to some …   Wikipedia

• Fast Fourier transform — A fast Fourier transform (FFT) is an efficient algorithm to compute the discrete Fourier transform (DFT) and its inverse. There are many distinct FFT algorithms involving a wide range of mathematics, from simple complex number arithmetic to group …   Wikipedia

• Discrete Fourier transform — Fourier transforms Continuous Fourier transform Fourier series Discrete Fourier transform Discrete time Fourier transform Related transforms In mathematics, the discrete Fourier transform (DFT) is a specific kind of discrete transform, used in… …   Wikipedia

• Discrete Fourier transform (general) — See also: Fourier transform on finite groups This article is about the discrete Fourier transform (DFT) over any field (including finite fields), commonly called a number theoretic transform (NTT) in the case of finite fields. For specific… …   Wikipedia

• Fourier transform — Fourier transforms Continuous Fourier transform Fourier series Discrete Fourier transform Discrete time Fourier transform Related transforms The Fourier transform is a mathematical operation that decomposes a function into its constituent… …   Wikipedia

• Weierstrass transform — In mathematics, the Weierstrass transform [Ahmed I. Zayed, Handbook of Function and Generalized Function Transformations , Chapter 18. CRC Press, 1996.] of a function f : R rarr; R is the function F defined by:F(x)=frac{1}{sqrt{4piint {… …   Wikipedia

• Integral transform — In mathematics, an integral transform is any transform T of the following form:: (Tf)(u) = int {t 1}^{t 2} K(t, u), f(t), dt.The input of this transform is a function f , and the output is another function Tf . An integral transform is a… …   Wikipedia

• Fast wavelet transform — The Fast Wavelet Transform is a mathematical algorithm designed to turn a waveform or signal in the time domain into a sequence of coefficients based on an orthogonal basis of small finite waves, or wavelets. The transform can be easily extended… …   Wikipedia

• Laplace transform — In mathematics, the Laplace transform is one of the best known and most widely used integral transforms. It is commonly used to produce an easily soluble algebraic equation from an ordinary differential equation. It has many important… …   Wikipedia

• Z-transform — In mathematics and signal processing, the Z transform converts a discrete time domain signal, which is a sequence of real or complex numbers, into a complex frequency domain representation. It is like a discrete equivalent of the Laplace… …   Wikipedia